package codeRandomThoughts.Test617合并二叉树;

import codeRandomThoughts.utils.TreeNode;

public class Solution {
    public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {
        //应该是遍历
        if (root1==null) return root2;
        if (root2==null) return root1;

        //根
        root1.val += root2.val;

        //左
        root1.left = mergeTrees(root1.left,root2.left);

        //右
        root1.right = mergeTrees(root1.right,root2.right);

        return root1;
    }
}
